Application of Ant Colony Optimization to the Routing and Wavelength Assignment Problem
نویسنده
چکیده
Title of Document: APPLICATION OF ANT COLONY OPTIMIZATION TO THE ROUTING AND WAVELENGTH ASSIGNMENT PROBLEM Eunmi Kim, Masters of Science, August 2007 Directed By: Associate Professor, Dr. Richard J. La, Department of Electrical and Computer Engineering The transmission capacity of a link in today’s optical networks has increased significantly due to wavelength-division multiplexing (WDM) technology. A unique feature of optical WDM networks is tight coupling between routing and wavelength selection. A lightpath is implemented by selecting a set or sequence of physical links between the source and destination nodes, and reserving a wavelength on each of these links for the lightpath. Thus, in establishing an optical connection we must deal with both routing (selecting a suitable path, i.e., sequence of physical links) and wavelength assignment (allocating an available wavelength for the connection (source-destination pair)). The resulting problem is referred to as the routing and wavelength assignment (RWA) problem, and is significantly more difficult than the routing problem in electrical networks. In this thesis, we offer a new heuristic algorithm to solve the RWA problem using Ant Colony Optimization (ACO) metaheuristic. An edge disjoint path problem and a partition coloring problem are used to formulate the algorithm.
منابع مشابه
Wavelength and Routing Assignment in All Optical Networks Using Ant Colony Optimization
Routing and Wavelength Assignment (RWA) in an arbitrary mesh network is an NP-complete problem. So far, this problem has been solved by linear programming for network topologies with a few nodes, and sub-optimally solved for larger networks by heuristic strategies and the application of optimization algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Differential Evol...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملA Hybrid Dynamic Programming for Inventory Routing Problem in Collaborative Reverse Supply Chains
Inventory routing problems arise as simultaneous decisions in inventory and routing optimization. In the present study, vendor managed inventory is proposed as a collaborative model for reverse supply chains and the optimization problem is modeled in terms of an inventory routing problem. The studied reverse supply chains include several return generators and recovery centers and one collection...
متن کاملAn Ant Colony Optimization Implementation for Dynamic Routing and Wavelength Assignment in Optical Networks
متن کامل
Dynamic Routing and Wavelength Assignment using Hybrid Particle Swarm Optimization for WDM Networks
This paper studies the problem of dynamic Routing and Wavelength Assignment (RWA) in Wavelength Division Multiplexed (WDM) networks with the wavelength the continuity constraint applied. A hybrid algorithm using Particle Swarm Optimization (PSO), inspired by an Ant System (AS), is used. For the routing sub-problem, particles of the swarm use the tour building approach of AS together with the ex...
متن کامل